A Functional Representation for Graph Matching

Graph Matching Based on Dot Product Representation of Graphs

Graph Matching for Shape

This paper describes a Bayesian graph matching algorithm for data-mining from large structural databases. The matching algorithm uses edge-consistency and node attribute similarity to determine the a posteriori probability of a query graph for each of the candidate matches in the database. The node feature-vectors are constructed by computing normalised histograms of pairwise geometric attribut...

A Semantic Graph Model for Text Representation and Matching in Document Mining

Graph Homomorphism Revisited for Graph Matching

In a variety of emerging applications one needs to decide whethera graph G matches another Gp, i.e., whether G has a topologicalstructure similar to that of Gp. The traditional notions of graphhomomorphism and isomorphism often fall short of capturing thestructural similarity in these applications. This paper studies revisions of these notions, providing a full treatment from co...

A Martingale Representation for Matching Estimators

A Martingale Representation for Matching Estimators Matching estimators are widely used in statistical data analysis. However, the distribution of matching estimators has been derived only for particular cases (Abadie and Imbens, 2006). This article establishes a martingale representation for matching estimators. This representation allows the use of martingale limit theorems to derive the asym...